Optimal Decision Trees Generation from OR-Decision Tables
نویسندگان
چکیده
In this paper we present a novel dynamic programming algorithm to synthesize an optimal decision tree from OR-decision tables, an extension of standard decision tables, which allow to choose between several alternative actions in the same rule. Experiments are reported, showing the computational time improvements over state of the art implementations of connected components labeling, using this modelling technique.
منابع مشابه
Optimal decision trees for local image processing algorithms
In this paper we present a novel algorithm to synthesize an optimal decision tree from OR-decision tables, an extension of standard decision tables, complete with the formal proof of optimality and computational cost analysis. As many problems which require to recognize particular patterns can be modeled with this formalism, we select two common binary image processing algorithms, namely connec...
متن کاملDecision Tree Construction using Greedy Algorithms and Dynamic Programming – Comparative Study
The paper presents comparative study for different heuristics used by greedy algorithms for constructing of decision trees. We consider the problem of exact learning for decision tables with discrete attributes. We made experiments with randomly generated decision tables contain attributes with three categories {0,1,2}. Complexity of decision trees is estimated relative to several cost function...
متن کاملReduction of Dimensionality of an Optimal Decision Table Conversion Algorithm
A dynamic programming algorithm for converting decision tables to optimal decision trees is analyzed. The complexity of the algorithm may be defined as the dimension of the domain of the minimal-cost functional. Upper bounds for this complexity are derived under various assumptions. Methods of reducing the dimensionality of the problem utilizing lower bounds for decision costs are also discussed.
متن کاملA New Algorithm for Optimization of Fuzzy Decision Tree in Data Mining
Decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. The resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. The most comprehensible decision trees have been designed for perfect symbolic data. Classical crisp decision trees (DT) are widely applied to classification t...
متن کاملDemand Response Based Model for Optimal Decision Making for Distribution Networks
In this paper, a heuristic mathematical model for optimal decision-making of a Distribution Company (DisCo) is proposed that employs demand response (DR) programs in order to participate in a day-ahead market, taking into account elastic and inelastic load models. The proposed model is an extended responsive load modeling that is based on price elasticity and customers’ incentives in which they...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011